Task-Decomposition via Plan
نویسندگان
چکیده
Task-decomposition planners make use of schemata that define tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called taslc reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan pursing approach to task-decomposition. Instead of reducing tasks into actions, we use an incremental parsing algorithm to recognize which partial primitive plans match the schemata. In essence, our approach exploits the observation that schemata are a convenient means for reducing search. We compile the schemata into a declarative search control language (like that used in machine learning research), which rejects plan refinements that, cannot be parsed. We demonstrate that neither parsing nor reduction dominates the other on efficiency grounds and provide preliminary empirical results comparing the two. We note that our parsing approach allows convenient, comparison (and combination) of different search control technologies, generates minimal plans, and handles expressive languages (e.g., universal quantification and conditional effects) with ease.
منابع مشابه
AAAI - 94 1 Task - Decomposition via Plan Parsing
Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...
متن کاملTask-Decomposition via Plan Parsing
Task-decomposition planners make use of schemata that de ne tasks in terms of partially ordered sets of tasks and primitive actions. Most existing taskdecomposition planners synthesize plans via a topdown approach, called task reduction, which uses schemata to replace tasks with networks of tasks and actions until only actions remain. In this paper we present a bottom-up plan parsing approach t...
متن کاملOrdered Task Decomposition
Ordered Task Decomposition is a new approach to HTN planning that appears to work quite well in a diverse set of real-world planning problems. This paper summarizes what Ordered Task Decomposition is, describes our past and current work on it, and describes our plans for future work.
متن کاملDecomposition in Task Based Multi-Agent Planning Systems
We discuss a general framework for coordinating self-interested agents in the pre-planning phase that can be used to decompose multi-agent task based planning problems into independent subproblems. The decomposition allows the agents to solve their part of the problem without the need to interact with other agents and such that the resulting plans can be easily combined into a joint plan. We il...
متن کاملTask Coordination and Decomposition in Multi-Actor Planning Systems
We discuss a framework for coordinating self-interested agents that can be used to decompose a multi-agent task based planning problem into independent subproblems. This problem decomposition can be achieved by a simple protocol and allows the agents to solve their part of the problem without the need to interact with other agents and in such a way that the resulting plans can be seamlessly int...
متن کامل